Notions of boundaries for function spaces

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

compactifications and function spaces on weighted semigruops

chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...

15 صفحه اول

The concentration function problem for $G$-spaces

‎In this note‎, ‎we consider the concentration function problem for a continuous action of a locally compact group $G$ on a locally compact Hausdorff space $X$‎. ‎We prove a necessary and sufficient condition for the concentration functions of a‎ ‎spread-out irreducible probability measure $mu$ on $G$ to converge to zero.

متن کامل

Notions of Probabilistic Computability on Represented Spaces

We define and compare several probabilistic notions of computability for mappings from represented spaces (that are equipped with a measure or outer measure) into computable metric spaces. We thereby generalize definitions by [Ko 1991] and Parker (see [Parker 2003, Parker 2005, Parker 2006]), and furthermore introduce the new notion of computability in the mean. Some results employ a notion of ...

متن کامل

The Notions of Application, Spaces and Agents

Agent-based approaches offer promising solutions for recent demands in enterprise software like adaptability cooperation and coordination (Jennings 2001). Industrial strength agent platforms, such as the JADE platform or Whitesteins LS/TS tool suite, serve as an established technological basis for agent-based programming and software development (Unland et al. 2005). While these systems conside...

متن کامل

On Different Reducibility Notions for Function Classes

This paper continues research of Toda (The Complexity of Finding Medians, 31 st Symposium on Foundations of Computer Science (1990), pp. 778{787) on problems complete for function classes like FP # P and Mid P under Krentel's metric reductions. We rst show that metric reductions wipe out the diierence between Mid P and other related classes of functions which are probably diierent from Mid P. I...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2002

ISSN: 0002-9939,1088-6826

DOI: 10.1090/s0002-9939-02-06425-0